clique graph
英 [kliːk ɡræf]
美 [kliːk ɡræf]
网络 团图
双语例句
- In this article, we introduce maximal connected subgraphs, maximal clique and perfect match of graph theory in biology especially in the study of protein structure research applications.
本文介绍了最大连通子图、最大团和完美匹配等图论知识在生物学尤其在研究蛋白质结构研究方面的应用。 - The algorithm converts surface matching problem into maximum weight clique searching problem in graph theory, and the optimal point correspondence set is represented by the maximum weight clique.
根据从接收节点得到的反馈信息，提出了一个图模型来刻画基于网络编码的重传问题，并将发送节点的重传策略模型化为图中的最小团划分。 - This problem is a generalization of the problem of finding the maximum cardinality clique of an unweighted graph.
这个问题是寻找无权图的最大团问题的推广。 - The circular clique number of a graph G, denoted by ω( G), is the maximum rational number k/ d such that K_ ( k/ d) admits a homomorphism to G.
图G的圆团数，记作Wc（G），是最大的有理数k/d满足存在一个从K（k/d）到G的同态。 - If the clique graph of a graph G is a bipartite graph, then the order of the smallest clique of G is less than or equal to the domatic number of G.
T.Hedetniemi的下列猜想的一个新证明：当图G的团图为2-分图时，G的最小团的阶数不大于G的可达划分数； - B.Hedman presented an algorithm for constructing the clique graph of a line graph.
B.Hedman在文[1]中介绍了构造线团图的一个算法。 - This paper introduces the DNA solution to the Maximum Weight Clique Problem of an undirected graph based on the plasmoid. On the basis of Head T et al, the algorithm is an effective and feasible method.
本文给出了基于质粒技术的无向图的最大权团问题的DNA算法，依据HeadT等的实验手段，本文提出的算法是有效并且可行的。 - Clique Covering Number and Clique Partition Number on the Graph of n Cycle Intermediate Spoke
n圈中辐图的团覆盖数和团划分数 - Global Broken Contour Connection Through Maximal Clique Graph Search Based on Relational Structural Constraints
最大集团图搜索法用于关系结构约束的全局等高线断线连接 - In this paper we derive some property of the clique graph of line graph by Hedman's algorithm.
本文用这一算法得到了线团图的一些性质。 - Relation Between Arboricity and Clique Covering Number of a Graph
荫度与团覆盖数的关系 - On the basis of the Hopfield networks, this paper deals with the maximal clique and the maximal independent set of a graph by mathematical analysis of the problem, the improvements of the performance are illustrated with some simulation examples.
本文应用Hopfield网络，系统地研究了图的最大团和最大独立集问题，通过建立相应的数学理论，改进了这方面已有的工作，并进行了模拟实验，给出了实验研究的结果。 - Assuming the difficulty of finding large cliques in random graphs, we can state that when a clique of sufficiently large size is randomly inserted into a random graph G, yielding graph G ′, finding any large clique in G ′ is still hard.
在随机图中找大团是难的假设下，可以证明当团K的大小足够大时，随机插入到随机图G产生G′，在G′中找任何大团仍是难的。 - Algorithm for maximal clique and independent set of a graph based on Hopfield networks
基于Hopneld网络的图的最大团和最大独立集算法 - The upper bounds of max-degree and clique number in k-equidistance graph;
k-等距图最大度和团数的上界； - Some Property of the Clique Graph of a Line Graph
线团图的一些性质 - The Clique Decomposition of a Graph
图的团分解 - In order to improve this condition, this paper presents converting mining optimal ingredient pattern of TCM into solving Maximum Weight Clique Problem of a vertex-weighted graph.
针对这一问题，该文将中药最优配方筛选问题转化为求一顶点赋权图的最大权团问题，利用求图的最大权团的算法实现中药最优配方筛选。 - The clique complex of a graph G is an abstract complex whose simplex is the cliques of G denoted by C ( G).
图G的团复形是一个抽象复形，它的单形是G的团，用C（G）表示。 - An Algorithm of Seeking Maximum Clique in Any Undirected Graph and Its Computer Programming
寻求任意无向图的最大团集的一个算法及其程序